Clustering with the multivariate normal inverse Gaussian distribution
نویسندگان
چکیده
منابع مشابه
The Multivariate Gaussian Distribution
A vector-valued random variable X = X 1 · · · X n T is said to have a multivariate normal (or Gaussian) distribution with mean µ ∈ R n and covariance matrix Σ ∈ S n ++ 1 if its probability density function 2 is given by p(x; µ, Σ) = 1 (2π) n/2 |Σ| 1/2 exp − 1 2 (x − µ) T Σ −1 (x − µ). We write this as X ∼ N (µ, Σ). In these notes, we describe multivariate Gaussians and some of their basic prope...
متن کاملThe Complex Multivariate Gaussian Distribution
Here I introduce package cmvnorm, a complex generalization of the mvtnorm package. A complex generalization of the Gaussian process is suggested and numerical results presented using the package. An application in the context of approximating the Weierstrass σ-function using a complex Gaussian process is given.
متن کاملpromotion time cure model with generalized poisson-inverse gaussian distribution
background & aim: in the survival data with long-term survivors the event has not occurred for all the patients despite long-term follow-up, so the survival time for a certain percent is censored at the end of the study. mixture cure model was introduced by boag, 1949 for reaching a more efficient analysis of this set of data. because of some disadvantages of this model non-mixtur...
متن کاملClustering Multivariate Gaussians for Normal Distribution Transform Grids
3D maps including urban structures and terrain information facilitate urban searches for robots operating in various robot scenarios. However it suffers from large memory requirements and computation time to deal with point clouds collected by range sensors. It is problematic for operating rescue robots in real time. NDT (Normal Distribution Transform) grid is a suitable map model to deal with ...
متن کاملClustering Multivariate Normal Distributions
In this paper, we consider the task of clustering multivariate normal distributions with respect to the relative entropy into a prescribed number, k, of clusters using a generalization of Lloyd’s k-means algorithm [1]. We revisit this information-theoretic clustering problem under the auspices of mixed-type Bregman divergences, and show that the approach of Davis and Dhillon [2] (NIPS*06) can a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Statistics & Data Analysis
سال: 2016
ISSN: 0167-9473
DOI: 10.1016/j.csda.2014.09.006